<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Jamming: heap/winnerTree.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">Jamming
   &#160;<span id="projectnumber">0.0.1</span>
   </div>
   <div id="projectbrief">An data structure and algorithm template library for quick C++ programming</div>
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.6.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<div class="title">heap/winnerTree.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * winnerTree.h</span>
<a name="l00003"></a>00003 <span class="comment"> * This file is part of Jamming</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (C) 2012 - Yi</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Jamming is free software; you can redistribute it and/or modify</span>
<a name="l00008"></a>00008 <span class="comment"> * it under the terms of the GNU General Public License as published by</span>
<a name="l00009"></a>00009 <span class="comment"> * the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00010"></a>00010 <span class="comment"> * (at your option) any later version.</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * Jamming is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00015"></a>00015 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> *</span>
<a name="l00017"></a>00017 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00018"></a>00018 <span class="comment"> * along with Jamming. If not, see &lt;http://www.gnu.org/licenses/&gt;.</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef __WINNERTREE_H__</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define __WINNERTREE_H__</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span><span class="preprocessor">#include &quot;deque.h&quot;</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include &quot;queue.h&quot;</span>
<a name="l00026"></a>00026 <span class="keyword">namespace </span>Heap {
<a name="l00027"></a>00027     <span class="keyword">template</span> &lt;<span class="keyword">class</span> T,<span class="keyword">class</span> Tcontainer = std::deque&lt;<span class="keywordtype">int</span>&gt;, <span class="keyword">class</span> ExternalChannel=std::priority_queue&lt;T&gt;, <span class="keyword">class</span> _TypeCompare=std::less&lt;T&gt; &gt;
<a name="l00028"></a><a class="code" href="classHeap_1_1WinnerTree.html">00028</a>     <span class="keyword">class </span><a class="code" href="classHeap_1_1WinnerTree.html">WinnerTree</a> {
<a name="l00029"></a>00029         Tcontainer internalNodes;
<a name="l00030"></a>00030         ExternalChannel&lt;T&gt;* externalNodes;
<a name="l00031"></a>00031         <span class="keywordtype">int</span> nExternalNodes,maxDepth,lowExt,offset;
<a name="l00032"></a>00032         <span class="keyword">inline</span> <span class="keywordtype">int</span> getMaxDepth() {
<a name="l00033"></a>00033             <span class="keywordflow">if</span>(nExternalNodes&lt;=0) <span class="keywordflow">return</span> -1;
<a name="l00034"></a>00034             <span class="keywordtype">int</span> d=0;
<a name="l00035"></a>00035             <span class="keywordflow">while</span>( (1&lt;&lt;d)+1 &lt; nExternalNodes) d++;
<a name="l00036"></a>00036             <span class="keywordflow">return</span> d;
<a name="l00037"></a>00037         }
<a name="l00038"></a>00038         <span class="keyword">inline</span> <span class="keywordtype">int</span> getLowExt() {<span class="keywordflow">return</span> (nExternalNodes-1&lt;&lt;maxDepth)&lt;&lt;1;}
<a name="l00039"></a>00039         <span class="keyword">inline</span> <span class="keywordtype">int</span> getOffset() {<span class="keywordflow">return</span> (1&lt;&lt;(maxDepth+1))-1;}
<a name="l00040"></a>00040         <span class="keyword">inline</span> <span class="keywordtype">int</span> parent(<span class="keywordtype">int</span> idx) {
<a name="l00041"></a>00041             <span class="keywordflow">return</span> idx&lt;lowExt? ((idx+1+offset)&gt;&gt;1)-1: ((nExternalNodes+idx-lowExt)&gt;&gt;1)-1; 
<a name="l00042"></a>00042         };
<a name="l00043"></a>00043         <span class="keyword">inline</span> <span class="keywordtype">int</span> __Ewinner__(<span class="keywordtype">int</span> idx1,<span class="keywordtype">int</span> idx2) { 
<a name="l00044"></a>00044             <span class="keywordflow">if</span>(!externalNodes[idx1] || !externalNodes[idx2]) <span class="keywordflow">return</span> -1; <span class="comment">//not able to play.</span>
<a name="l00045"></a>00045             <span class="keywordflow">if</span>(!externalNodes[idx1].empty() ||!externalNodes[idx2].empty()) <span class="keywordflow">return</span> -1;
<a name="l00046"></a>00046             <span class="keywordflow">return</span> (externalNodes[idx1].top() &gt; externalNodes[idx2].top())? idx1:idx2;  <span class="comment">// maximum heap, compare function?</span>
<a name="l00047"></a>00047         } <span class="comment">//winner of contest of external nodes</span>
<a name="l00048"></a>00048         <span class="keyword">inline</span> <span class="keywordtype">int</span> __Iwinner__(<span class="keywordtype">int</span> idx1,<span class="keywordtype">int</span> idx2) { 
<a name="l00049"></a>00049             <span class="keywordflow">if</span>(internalNodes[idx1]&lt;0 || internalNodes[idx2]&lt;0) <span class="keywordflow">return</span> -1; 
<a name="l00050"></a>00050             <span class="keywordflow">if</span>(!externalNodes[internalNodes[idx1]] || !externalNodes[internalNodes[idx2]]) <span class="keywordflow">return</span> -1;
<a name="l00051"></a>00051             <span class="keywordflow">if</span>(!externalNodes[internalNodes[idx1]].empty() ||!externalNodes[internalNodes[idx2]].empty()) <span class="keywordflow">return</span> -1;
<a name="l00052"></a>00052             <span class="keywordflow">return</span> (externalNodes[internalNodes[idx1]].top() &gt;externalNodes[internalNodes[idx2]].top())? idx1:idx2;
<a name="l00053"></a>00053         } <span class="comment">// winner of contest of internal nodes.</span>
<a name="l00054"></a>00054         <span class="keyword">inline</span> upwardContest(<span class="keywordtype">int</span> idx){
<a name="l00055"></a>00055             <span class="keywordflow">while</span>( idx !=0) {
<a name="l00056"></a>00056                 <span class="keywordflow">if</span>(idx&amp;1) {
<a name="l00057"></a>00057                     internalNodes[idx&gt;&gt;1]=__Iwinner__(idx-1,idx);
<a name="l00058"></a>00058                 } 
<a name="l00059"></a>00059                 idx=idx&gt;&gt;1;
<a name="l00060"></a>00060             }
<a name="l00061"></a>00061         };
<a name="l00062"></a>00062         replay(<span class="keywordtype">int</span> idx){
<a name="l00063"></a>00063             <span class="keywordflow">if</span>(idx==lowExt &amp;&amp; n&amp;1) { <span class="comment">//play with internal winner</span>
<a name="l00064"></a>00064                 internalNodes[(n&gt;&gt;1)-1]=__winner__(internalNodes[n-2],lowExt);
<a name="l00065"></a>00065                 upwardContest(parent(idx));
<a name="l00066"></a>00066                 <span class="keywordflow">return</span>;
<a name="l00067"></a>00067             }
<a name="l00068"></a>00068             <span class="keywordflow">if</span>(idx&amp;1) {
<a name="l00069"></a>00069                 <span class="comment">//even nodes(idx=nth-1) idx=1,3,5,...</span>
<a name="l00070"></a>00070                 internalNodes[parent(idx)]=__Ewinner__(idx,idx-1); upwardContest(parent(idx));
<a name="l00071"></a>00071             } <span class="keywordflow">else</span> {
<a name="l00072"></a>00072                 <span class="comment">//odd nodes idx=0,2,4,...</span>
<a name="l00073"></a>00073                 internalNodes[parent(idx)]=__Ewinner__(idx,idx+1); upwardContest(parent(idx));
<a name="l00074"></a>00074             }
<a name="l00075"></a>00075         };
<a name="l00076"></a>00076         organize() {
<a name="l00077"></a>00077             maxDepth=getMaxDepth();
<a name="l00078"></a>00078             lowExt=getLowExt();
<a name="l00079"></a>00079             offset=getOffset();
<a name="l00080"></a>00080             <span class="keywordflow">for</span>(<span class="keyword">register</span> <span class="keywordtype">int</span> i=0;i&lt;lowExt;i+=2) {internalNodes[parent(i)]=__Ewinner__(i,i+1); upwardContest(parent(i));}
<a name="l00081"></a>00081             <span class="keywordflow">if</span>(n&amp;1) { <span class="comment">// n is odd</span>
<a name="l00082"></a>00082                 internalNodes[(n&gt;&gt;1)-1]=__winner__(internalNodes[n-2],lowExt);
<a name="l00083"></a>00083                 upwardContest(parent(i));
<a name="l00084"></a>00084                 i++;
<a name="l00085"></a>00085             }
<a name="l00086"></a>00086             <span class="keywordflow">for</span>(;i&lt;n;i+=2) {internalNodes[parent(i)]=__Ewinner__(i,i+1);upwardContest(parent(i));}
<a name="l00087"></a>00087         };
<a name="l00088"></a>00088         <span class="keyword">public</span>:
<a name="l00089"></a>00089         <a class="code" href="classHeap_1_1WinnerTree.html">WinnerTree</a>(<span class="keywordtype">int</span> nChannel=1) {
<a name="l00090"></a>00090             nExternalNodes=nChannel;
<a name="l00091"></a>00091         };
<a name="l00092"></a>00092         modifyChannel(<span class="keywordtype">int</span> idx,ExternalChannel channel) {
<a name="l00093"></a>00093             externalNodes[idx]=channel;
<a name="l00094"></a>00094             replay(idx);
<a name="l00095"></a>00095         };
<a name="l00096"></a>00096         addExternalChannel(ExternalChannel* channel) {
<a name="l00097"></a>00097             externalNodes.push_back(channel);
<a name="l00098"></a>00098             nExternalNodes++;
<a name="l00099"></a>00099             organize();
<a name="l00100"></a>00100         };
<a name="l00101"></a>00101         removeExternalChannel(<span class="keywordtype">int</span> idx) {
<a name="l00102"></a>00102             externNodes.remove(idx);
<a name="l00103"></a>00103             nExternalNodes--;
<a name="l00104"></a>00104             organize();
<a name="l00105"></a>00105         };
<a name="l00106"></a>00106         T top() {
<a name="l00107"></a>00107             <span class="keywordflow">if</span>(internalNodes[0]&lt;0 || !internalNodes[0]) <span class="keyword">raise</span> 1;<span class="comment">//NotInitialized();</span>
<a name="l00108"></a>00108             <span class="keywordflow">return</span> externalNodes[internalNodes[0]];
<a name="l00109"></a>00109         };
<a name="l00110"></a>00110         ExternalChannel&lt;T&gt;* topChannel() {
<a name="l00111"></a>00111             <span class="keywordflow">return</span> internalNodes[0];
<a name="l00112"></a>00112         };
<a name="l00113"></a>00113         T pop() {
<a name="l00114"></a>00114             <span class="keywordflow">if</span>(internalNodes[0]&lt;0 || !internalNodes[0]) <span class="keyword">raise</span> 1;<span class="comment">//NotInitialized();</span>
<a name="l00115"></a>00115             <span class="keywordflow">if</span>(!internalNodes[0].empty()) <span class="keywordflow">return</span> internalNodes[0].pop();
<a name="l00116"></a>00116             <span class="keywordflow">else</span> removeExternalChannel(internalNodes[0]);
<a name="l00117"></a>00117         };
<a name="l00118"></a>00118     };
<a name="l00119"></a><a class="code" href="classHeap_1_1Buffer.html">00119</a>     <span class="keyword">class </span><a class="code" href="classHeap_1_1Buffer.html">Buffer</a> : <span class="keyword">public</span> <a class="code" href="classHeap_1_1BinaryHeap.html">BinaryHeap</a> {
<a name="l00120"></a>00120     
<a name="l00121"></a>00121     };
<a name="l00122"></a>00122 };
<a name="l00123"></a>00123 
<a name="l00124"></a>00124 <span class="preprocessor">#endif </span><span class="comment">/* __WINNERTREE_H__ */</span>
<a name="l00125"></a>00125 
</pre></div></div><!-- contents -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Typedefs</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated on Sat Jan 26 2013 22:18:27 for Jamming by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>

</body>
</html>
